Image Segmentation by Construction of Shortest Spanning Tree Using Prim’s Algorithm

The paper aims at segmenting an image. The goal of image segmentation is to simplify and/or change the representation of an image into something that is more meaningful and simpler to analyze. In this paper we consider segmenting the image using the shortest spanning tree. To find the shortest spanning tree the image is first mapped into a graph. There have already been research conducted in this region of image processing where the segmentation of an image is performed using the shortest spanning tree. In the previous research papers the shortest spanning tree is found using the Kruskal’s algorithm. In this paper we will find the shortest spanning tree using the Prims algorithm and compare the changes in the end results of the two researches conducted .Within the scope of this paper we will be proposing the use of prims algorithm for solving image segmentation. Index Terms — image segmentation, Kruskal’s algorithm, mapping, Prims algorithm, representation of image, shortest spanning tree ——————————  ——————————